/*
 * Copyright 2020-2030 the original author or authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      https://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.extraty.question14;

/**
 * @author Created by Neil Wang
 * @version 1.0.0
 * @date 2021/9/1 3:29 下午
 */
public class Solution1 {
    public String longestCommonPrefix(String[] strs) {
        int length = strs[0].length();
        int count = strs.length;
        for (int i = 0; i < length; i++) {
            char value = strs[0].charAt(i);
            for (int j = 1; j < count; j++) {
                if (outOfSize(strs[j], i) || diffValue(strs[j].charAt(i), value))
                    return strs[0].substring(0, i);
            }
        }
        return strs[0];
    }

    private boolean diffValue(char target, char value) {
        return target != value;
    }

    private boolean outOfSize(String str, int i) {
        return i == str.length();
    }
}
